An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection

An Algorithm for Large-Scale Quadratic Programming

We are particularly concerned in solving (1.1) when n is large and the vectors a, and matrix H are sparse. We do not restrict H to being positive (semi-)definite and consequently are content with finding local solutions to (1.1). Of course, for many classes of problem, it is known a priori that any local solution is a global one. Our method is fundamentally related to that proposed by Fletcher ...

An efficient algorithm for large scale stochastic nonlinear programming problems

The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including those in the field of process systems engineering. But despite the apparent importance of such problems, the solution algorithms for these problems have found few applications due to the severe computational and structural...

An efficient algorithm for large-scale detection of protein families.

Detection of protein families in large databases is one of the principal research objectives in structural and functional genomics. Protein family classification can significantly contribute to the delineation of functional diversity of homologous proteins, the prediction of function based on domain architecture or the presence of sequence motifs as well as comparative genomics, providing valua...

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

Large-scale decomposition for successive quadratic programming